Nonrandom binary superimposed codes
نویسندگان
چکیده
PI W. W. Peterson, “Error-Correcting Codes,” John Wiley and Sons, Inc., New York, N. Y.; 1961. E. Gorog, ‘(Some new classes of cyclic codes used for burst-error correction,” IBM J. Res. Developm., vol. 7, pp. 102-111; April, 1963. R. C. Bose and C. R. Ray-Chaudhuri, “On a class of errorcorrecting binary group codes,” Information and Control, vol. 3, pp. 68-79; 1960. A. Hocquenghem, “Codes correcteurs d’erreurs,” Chi$res, vol. 2, pp. 147-156; September, 1959. W. W. Peterson, “Encoding and error-correction procedures for the Bose-Chaudhuri codes,” IRE TRANS. ON INBORMATION THEORY, vol. IT-6, pp. 459-470; September, 1960. N. Zieler and D. Gorenstein, “A class of error-correcting codes in wm svmbols.” J. Sot. Ind. Appl. Math., vol. 9, pp. 207-214; J&e, f961. ’ _ _
منابع مشابه
Bounds on the rate of disjunctive codes (in Russian)
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets...
متن کاملBounds on the rate of disjunctive codes
A binary code is called a superimposed cover-free (s, ℓ)-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of ℓ sets is covered by the union of s others. A binary code is called a superimposed list-decoding s L-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any s sets can cover not ...
متن کاملAn Improved Upper Bound of the Rate of Euclidean Superimposed Codes
A family of n-dimensional unit norm vectors is a Euclidean superimposed code, if the sums of any two distinct at most m-tuples of vectors are separated by a certain minimum Euclidean distance d. Ericson and Györfi [8] proved that the rate of such a code is between (logm)/4m and (logm)/m for m large enough. In this paper – improving the above longstanding best upper bound for the rate – it is sh...
متن کاملOn Optimal Superimposed Codes
A (w, r ) cover-free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A binary (w, r ) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as a concept of key distribution patterns. In this paper, we develop a method of constructing superimposed codes and prove ...
متن کاملLectures on Designing Screening Experiments
Preface Designing Screening Experiments (DSE) is a class of information-theoretical models for multiple-access channels (MAC). In Sect. 2-4, we discuss the combinatorial model of DSE called a disjunct channel model. This model is the most important for applications and closely connected with the superimposed code concept. In Sect. 2, we give a detailed survey of lower and upper bounds on the ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 10 شماره
صفحات -
تاریخ انتشار 1964